A theoretical evaluation of selected backtracking algorithms
نویسندگان
چکیده
منابع مشابه
A Theoretical Evaluation of Selected Backtracking Algorithms
In recent years, many new backtracking algorithms for solving constraint satisfaction problems have been proposed. The algorithms are usually evaluated by empirical testing. This method, however, has its limitations. Our paper adopts a different, purely theoretical approach, which is based on characterizations of the sets of search tree nodes visited by the backtracking algorithms. A notion of ...
متن کاملBacktracking Search Algorithms
There are three main algorithmic techniques for solving constraint satisfaction problems: backtracking search, local search, and dynamic programming. In this chapter, I survey backtracking search algorithms. Algorithms based on dynamic programming [15]— sometimes referred to in the literature as variable elimination, synthesis, or inference algorithms—are the topic of Chapter 7. Local or stocha...
متن کاملAn Expected-Cost Analysis of Backtracking and Non-Backtracking Algorithms
Consider an infinite binary search tree in which the branches have independent random costs. Suppose that we must find an optimal (cheapest) or nearly optimal path from the root to a node at depth n. Karp and Pearl [1983] show that a bounded-lookahead backtracking algorithm A2 usually finds a nearly optimal path in linear expected time (when the costs take only the values 0 or 1). From this suc...
متن کاملBetter Algorithms for Parallel Backtracking
Many algorithms in operations research and artiicial intelligence are based on the backtracking principle, i.e., depth rst search in implicitly deened trees. For parallelizing these algorithms, a load balancing scheme is needed which is able to evenly distribute the parts of an irregularly shaped tree over the processors. It should work with minimal interprocessor communication and without prio...
متن کاملUnrestricted Backtracking Algorithms for Satisfiability
This paper proposes a general framework for implementing backtracking search strategies in Propositional Satisfiability (SAT) algorithms, that is referred to unrestricted backtracking. Different organizations of unrestricted backtracking yield well-known backtracking search strategies. Moreover, this general framework allows devising new backtracking strategies. Hence, we illustrate and compare...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 1997
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(96)00027-6